منابع مشابه
One-Tape, Off-Line Turing Machine Computations
In this paper we shall consider Turing machines tha t can, at any given step in their computations, do each of the following things: (a) change the tape symbols currently scanned by their reading heads, (b) shift each of their tapes one square to the left or right, (c) change their internal state, and (d) halt. Each step is assumed to require exactly one t ime unit for its completion. I n order...
متن کاملAlan Turing Universal Turing Machine
In recent years, much research has been devoted to the synthesis of gigabit switches; on the other hand, few have explored the refinement of hash tables. In fact, few cryptographers would disagree with the improvement of the lookaside buffer. In this work, we use signed technology to show that architecture and superblocks are usually incompatible.
متن کاملA Note on Bulk Quantum Turing Machine
Recently, among experiments for realization of quantum computers, NMR quantum computers have achieved the most impressive succession. There is a model of the NMR quantum computation by Atsumi and Nishino’s bulk quantum Turing machine. It assumes, however, an unnatural assumption with quantum mechanics. We, then, define a more natural and quantum mechanically realizable modified bulk quantum Tur...
متن کاملOn Halting Process of Quantum Turing Machine
We prove that there is no algorithm to tell whether an arbitrarily constructed Quantum Turing Machine has same time steps for different branches of computation. We, hence, can not avoid the notion of halting to be probabilistic in Quantum Turing Machine. Our result suggests that halting scheme of Quantum Turing Machine and quantum complexity theory based upon the existing halting scheme sholud ...
متن کاملOn Quantum Turing Machine Halting Deterministically
We define a subclass of quantum Turing machine (QTM) named SR-QTM, which halts deterministically and has deterministic tape head position. A quantum state transition diagram (QSTD) is proposed to describe SR-QTM. With the help of QSTD, we construct a SR-QTM which is universal for all near-trivial transformations. This means there exists a QTM which is universal for the above subclass. Finally w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1968
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(68)90477-4